Reasoning About Permitted Announcements
نویسندگان
چکیده
We formalize what it means to have permission to say something. We adapt the dynamic logic of permission by van der Meyden [22] to the case where atomic actions are public truthful announcements. We also add a notion of obligation. Our logic is an extension of the logic of public announcements introduced by Plaza [17] with dynamic modal operators for permission and for obligation. We axiomatize the logic and show that it is decidable.
منابع مشابه
Reasoning about permitted announcements ( extended
Four players are playing the french game ”la belote”. All the 32 cards are dealt, each player starts the game with eight cards and she knows them, and all of this is common knowledge. We can formalize this situation using epistemic logic (see [8] for more details): the set of propositional atoms of our language is {(V C)i|V ∈ {7, 8, 9, 10, J,Q,K,A}, C ∈ {♣,♥,♦,♠}, i ∈ {1, 2, 3, 4}}. The model o...
متن کاملTR-2007025: Public Communication in Justification Logic
Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...
متن کاملPublic communication in justification logic
Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...
متن کاملEfficient reasoning about actions based on assignments and announcements
We propose a reasoning about actions framework based on a combination of epistemic logic and star-free PDL, into which we integrate Reiter’s solution to the frame problem. We then show that prediction (alias plan verification) can be reduced in polynomial time to dynamic epistemic logic with assignments that has recently been proposed by Kooi et al.. We establish decidability and complexity res...
متن کاملThe undecidability of group announcements
This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is decidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Philosophical Logic
دوره 40 شماره
صفحات -
تاریخ انتشار 2011